Research of Strip Flatness Control Based on Legendre Polynomial Decomposition

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Research of Strip Flatness Control Based on Legendre Polynomial Decom- position

Abstract: A traditional least squares has negatively a clear physical significance in the process of strip flatness pattern recognition and it is too complex in calculation to be suitable for industrial controller to realize. In this paper we deduced the basic model of strip flatness pattern recognition based on Legendre polynomial. Under this mode, there are three outstanding advantages: The i...

متن کامل

Flatness based control of oscillators

The aim of this paper is to present some recent developments and hints for future researches in control inspired of flatnessbased ideas. We focus on motion planning: Steering a system from one state to another. We do not consider stabilization and trajectory tracking. We explain how explicit trajectory parameterization, a property that is central for flat systems, can be useful for the feed-for...

متن کامل

A short overview of the electrical machines control based on Flatness-technique

Optimal linear controllers and high computational non-linear controllers are normally applied to control the nonlinear systems. Flatness control method is a control technique for linear systems as well as nonlinear systems by static and dynamic feedback namely as endogenous dynamic feedback. This method takes into account the non-linear behavior of the process while preventing complicated compu...

متن کامل

Legendre Tensor Decomposition

We present a novel nonnegative tensor decomposition method, called Legendre decomposition, which factorizes an input tensor into a multiplicative combination of parameters. Thanks to the well-developed theory of information geometry, the reconstructed tensor is unique and alwaysminimizes the KL divergence from an input tensor. We empirically show that Legendre decomposition can more accurately ...

متن کامل

Divergent Legendre-sobolev Polynomial Series

Let be introduced the Sobolev-type inner product (f, g) = 1 2 Z 1 −1 f(x)g(x)dx + M [f ′(1)g′(1) + f ′(−1)g′(−1)], where M ≥ 0. In this paper we will prove that for 1 ≤ p ≤ 4 3 there are functions f ∈ L([−1, 1]) whose Fourier expansion in terms of the orthonormal polynomials with respect to the above Sobolev inner product are divergent almost everywhere on [−1, 1]. We also show that, for some v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Open Automation and Control Systems Journal

سال: 2015

ISSN: 1874-4443

DOI: 10.2174/1874444301507010203